P . Bouyer , C . Dufourd , E . Fleury and A . Petit Are Timed Automata Updatable ? Research

Are Timed Automata Updatable?

Expressiveness of Updatable Timed Automata

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...

Updatable timed automata

We investigate extensions of Alur and Dill’s timed automata, based on the possibility to update the clocks in a more elaborate way than simply reset them to zero. We call these automata updatable timed automata. They form an undecidable class of models, in the sense that emptiness checking is not decidable. However, using an extension of the region graph construction, we exhibit interesting dec...

Üôöö×××úòò×× Óó Íôøøøðð Ììñññ Ùøóññøø

P . Bouyer A New Algorithm to Decide Emptiness of Updatable Timed Automata Research